Scheduling on Parallel Computer System Job Scheduling Thread Scheduling Space Slicing Static Partitioning Dynamic Partitioning Time Slicing
نویسندگان
چکیده
We propose a new family of job scheduling policies for parallel computer systems that can be optimized to adapt to changes in the workload. Simulation optimization is used to reveal important properties of optimal job scheduling policies. For this optimization a new approach is suggested that combines two recent stochastic optimization methods: the nested partitions method and ordinal optimization.
منابع مشابه
Executing Communication-Intensive Irregular Programs Efficiently
We consider the problem of eÆciently executing completely irregular, communication-intensive parallel programs. Completely irregular programs are those whose number of parallel threads as well as the amount of computation performed in each thread vary during execution. Our programs run on MIMD computers with some form of space-slicing (partitioning) and time-slicing (scheduling) support. A hard...
متن کاملA Mes Parents
Parallel job scheduling is an important problem whose solution may lead to better utilization of modern parallel computers. It is de ned as : Given the aggregate of all tasks of multiple jobs in a parallel system, nd a spatial and temporal allocation to execute all tasks e ciently . For the purposes of scheduling, we view a computer as a queueing system. An arriving job may wait for some time, ...
متن کاملEvaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control
several other experimental systems [13, 39, 4, 17, 6]. At first blush, it might appear that gang scheduling is a luxury that may not be worth the price. An optimal packing of gangs that gives minimal wasted processors is an NPcomplete problem. Migration of gangs might be required to compensate for a poor initial mapping. The code to simultaneously schedule all the threads of each gang might be ...
متن کاملJob Scheduling in Multiprogrammed Parallel Systems
Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in a program to processors, so as to minimize the makespan. This formulation assumes that the processors are dedicated to the program in question. But when the parallel system is shared by a number of users, this is not necessarily the case. In the context of multiprogrammed parallel machines, scheduli...
متن کاملExtended Version Job Scheduling in Multiprogrammed Parallel Systems
Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in a program to processors, so as to minimize the makespan. This formulation assumes that the processors are dedicated to the program in question. But when the parallel system is shared by a number of users, this is not necessarily the case. In the context of multiprogrammed parallel machines, scheduli...
متن کامل